Computing the entropy of one-dimensional decidable subshifts
نویسندگان
چکیده
We characterise the difficulty of computing topological entropy of one-dimensional subshifts under various dynamical restrictions. Entropy is known to be computable from above for general one-dimensional subshifts, and the aim of the article is to distinguish under which dynamical properties it becomes computable. The considered properties are minimality, unique ergodicity, and various forms of topological mixing. In each case, we are also able to characterise by computability conditions the set of reals that can appear as topological entropy.
منابع مشابه
The Spatial Entropy of Two-Dimensional Subshifts of Finite Type
In this paper, two recursive formulas for computing the spatial entropy of two-dimensional subshifts of finite type are given. The exact entropy of a nontrivial example arising in cellular neural networks is obtained by using such formulas. We also establish some general theory concerning the spatial entropy of two-dimensional subshifts of finite type. In particular, we show that if either of t...
متن کاملOn the Computability of the Topological Entropy of Subshifts
We prove that the topological entropy of subshifts having decidable language is uncomputable in the following sense: For no error bound less than 1/4 does there exists a program that, given a decision procedure for the language of a subshift as input, will approximate the entropy of the subshift within the error bound. In addition, we prove that not only is the topological entropy of sofic shif...
متن کاملOn the Spatial Entropy of Two-Dimensional Golden Mean
The dynamical properties of one-dimensional subshifts of finite type (Markov shifts) are well understood. However, not much is known for a general theory of higher dimensional subshifts. For instance, the spatial entropy of subshifts of finite type is known to be the logarithm of the largest eigenvalue of its corresponding transition matrix. On the other hand, very little is known on the spatia...
متن کاملHigher-dimensional Subshifts of Finite Type, Factor Maps and Measures of Maximal Entropy
We investigate factor maps of higher-dimensional subshifts of finite type. In particular, we are interested in how the number of ergodic measures of maximal entropy behaves under such factor maps. We show that this number is preserved under almost invertible maps, but not in general under finite to one factor maps. One of our tools, which is of independent interest, is a higher-dimensional char...
متن کاملEntropy and Measures of Maximal Entropy for Axial Powers of Subshifts
The notions of “limiting entropy” and “independence entropy” for one-dimensional subshifts were introduced by Louidor, Marcus, and the second author in [15]. It was also implicitly conjectured there that these two quantities are always equal. We verify this conjecture, which implies, among other things, that the limiting entropy of any one-dimensional SFT is of the form 1 n log k for k, n ∈ N. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1602.06166 شماره
صفحات -
تاریخ انتشار 2016